Inverse sum indeg index of graphs
نویسندگان
چکیده
منابع مشابه
On Sum–Connectivity Index of Bicyclic Graphs
We determine the minimum sum–connectivity index of bicyclic graphs with n vertices and matching number m, where 2 ≤ m ≤ ⌊n2 ⌋, the minimum and the second minimum, as well as the maximum and the second maximum sum–connectivity indices of bicyclic graphs with n ≥ 5 vertices. The extremal graphs are characterized. MSC 2000: 05C90; 05C35; 05C07
متن کاملon the general sum–connectivity co–index of graphs
in this paper, a new molecular-structure descriptor, the general sum–connectivity co–index is considered, which generalizes the first zagreb co–index and the general sum–connectivity index of graph theory. we mainly explore the lower and upper bounds in termsof the order and size for this new invariant. additionally, the nordhaus–gaddum–type resultis also represented.
متن کاملThe Maximum Balaban Index (Sum-Balaban Index) of Unicyclic Graphs
The Balaban index of a connected graph G is defined as J(G) = |E(G)| μ+ 1 ∑ e=uv∈E(G) 1 √ DG(u)DG(v) , and the Sum-Balaban index is defined as SJ(G) = |E(G)| μ+ 1 ∑ e=uv∈E(G) 1 √ DG(u)+DG(v) , where DG(u) = ∑ w∈V (G) dG(u,w), and μ is the cyclomatic number of G. In this paper, the unicyclic graphs with the maximum Balaban index and the maximum Sum-Balaban index among all unicyclic graphs on n v...
متن کاملThe Extremal Graphs for (Sum-) Balaban Index of Spiro and Polyphenyl Hexagonal Chains
As highly discriminant distance-based topological indices, the Balaban index and the sum-Balaban index of a graph $G$ are defined as $J(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)D_{G}(v)}}$ and $SJ(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)+D_{G}(v)}}$, respectively, where $D_{G}(u)=sumlimits_{vin V}d(u,v)$ is the distance sum of vertex $u$ in $G$, $m$ is the n...
متن کاملOn the variable sum exdeg index and cut edges of graphs
The variable sum exdeg index of a graph G is defined as $SEI_a(G)=sum_{uin V(G)}d_G(u)a^{d_G(u)}$, where $aneq 1$ is a positive real number, du(u) is the degree of a vertex u ∈ V (G). In this paper, we characterize the graphs with the extremum variable sum exdeg index among all the graphs having a fixed number of vertices and cut edges, for every a>1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2018
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2017.06.001